Fast Inversions in Small Finite Fields by Using Binary Trees
نویسندگان
چکیده
منابع مشابه
Enumeration of trees by inversions
Mallows and Riordan “The Inversion Enumerator for Labeled Trees,” Bulletin of the American Mathematics Society, vol. 74 119681 pp. 92-94) first defined the inversion polynomial, JJ9) for trees with n vertices and found its generating function. In the present work, we define inversion polynomials for ordered, plane, and cyclic trees, and find their values at 9 = 0, t l . Our techniques involve t...
متن کاملSmall Binary Voting Trees
Sophisticated voting on a binary tree is a common form of voting structure, as exemplified by, for example, amendment procedures. The problem of characterizing voting rules that can be the outcome of this procedure has been a longstanding problem in social choice. We explore rules over a small number of candidates, and discuss existence and nonexistence properties of rules implementable over tr...
متن کاملFast Trajectory Matching Using Small Binary Images
This paper proposes a new trajectory matching method using logic operations on binary images. By using small binary images we are able to effectively utilize the large word size offered in modern CPU architectures, resulting in a very efficient evaluation of similarities between trajectories. The efficiency is caused by the fact that all bits in the same word are processed in parallel. Represen...
متن کاملMeasures of pseudorandomness for binary sequences constructed using finite fields
We extend the results of Goubin, Mauduit and Sárközy on the well-distribution measure and the correlation measure of order k of the sequence of Legendre sequences with polynomial argument in several ways. We analyze sequences of quadratic characters of finite fields of prime power order and consider in each case two, in general, different definitions of well-distribution measure and correlation...
متن کاملFast Multiplication in Finite Fields GF(2)
A method is described for performing computations in a finite field GF(2 ) by embedding it in a larger ring Rp where the multiplication operation is a convolution product and the squaring operation is a rearrangement of bits. Multiplication in Rp has complexity N +1, which is approximately twice as efficient as optimal normal basis multiplication (ONB) or Montgomery multiplication in GF(2 ), wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2016
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxw009